Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates
نویسندگان
چکیده
Current data models like the NF2 model and object,-oriented models support set-valued at.t,ribut,t:s. Hence, it, becomes possible to havt> join prcdica.tes ba.sed on set, comparison. This paper int,roduces and evaluates two main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on subset predicates.
منابع مشابه
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
Current data models like the NF2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate e ciently this kind of join. More speci cally, we concentrate on the set equality and the subset predicates.
متن کاملEvaluation of Main Memory Join Algorithms for
Current data models like the NF 2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates two main memory algorithms to evaluate eeciently this kind of join. More speciically, we concentrate on subset predicates.
متن کاملOn Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern database applications involving geospatial data such as GIS, efficient evaluation of joins with other spatial predicates is yet to be fully explored. In addition, most existing join algorithms were developed for two-way joi...
متن کاملPlug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
This paper presents Plug&Join, a new generic algorithm for efficiently processing a broad class of different types of joins in an extensible database system. Plug&Join is not only designed to support equi joins, temporal joins, spatial joins, subset joins and other types of joins, but in contrast to previous algorithms it can be easily customized and it allows efficient processing of new types ...
متن کاملFast similarity join for multi-dimensional data
To appear in Information Systems Journal, Elsevier, 2005 The efficient processing of multidimensional similarity joins is important for a large class of applications. The dimensionality of the data for these applications ranges from low to high. Most existing methods have focused on the execution of high-dimensional joins over large amounts of disk-based data. The increasing sizes of main memor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998